Finding Gale Strings

La lutte contre les argaside, gale psoroptique et phtiriase des moutons par l'administration des insecticides par la vole buccale

The Number of Stable Matchings in Models of the Gale–shapley Type with Preferences given by Partial Orders

From the famous Gale–Shapley theorem we know that each classical marriage problem admits at least one stable matching. This fact has inspired researchers to search for the maximum number of possible stable matchings, which is equivalent to finding the minimum number of unstable matchings among all such problems of size n. In this paper, we deal with this issue for the Gale–Shapley model with pr...

Finding Palindromes: Variants and Algorithms

The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It also introduces properties for palindrome predicates, and shows which predicates satisfy which properties. Th...

On Approximating String Selection Problems with Outliers

Many problems in bioinformatics are about finding strings that approximately represent a collection of given strings. We look at more general problems where some input strings can be classified as outliers. The Close to Most Strings problem is, given a set S of same-length strings, and a parameter d, find a string x that maximizes the number of “non-outliers” within Hamming distance d of x. We ...

W Strings and Cohomology in Parafermionic Theories

By enforcing locality we relate the cohomology found in parafermionic theories to that occurring in W strings. This link provides a systematic method of finding states in the cohomology of W 2,s strings.